Multiple search problem on reconfigurable meshesCHAO, C.-C; CHEN, W.-T; CHEN, G.-H et al.Information processing letters. 1996, Vol 58, Num 2, pp 65-69, issn 0020-0190Article

Optimal sequential search: a Bayesian approachASSAF, D; SHMUEL ZAMIR.Annals of statistics. 1985, Vol 13, Num 3, pp 1213-1221, issn 0090-5364Article

Infinite families on bi-embeddingsCABANISS, S; JACKSON, B. W.Discrete mathematics. 1990, Vol 82, Num 2, pp 127-141, issn 0012-365X, 15 p.Article

A technique for adding range restrictions to generalized searching problemsGUPTA, P; JANARDAN, R; SMID, M et al.Information processing letters. 1997, Vol 64, Num 5, pp 263-269, issn 0020-0190Article

The revenge of the linear search problemBECK, A; BECK, M.SIAM journal on control and optimization. 1992, Vol 30, Num 1, pp 112-122, issn 0363-0129Article

The defective coin problem: an algorithmic analysisSURESH ANKOLEKAR; ARINDAM DAS GUPTA; SRINIVASAN, G et al.Kybernetes. 1990, Vol 19, Num 5, pp 44-58, issn 0368-492X, 15 p.Article

Global optimizationTÖRN, A; ZILINSKAS, A.Lecture notes in computer science. 1989, Vol 350, issn 0302-9743, V-X, 1-255 [261 p.]Article

An entropic approach to the optimum serrch for the optimum of a unimodal functionGUIASU, S.Information sciences. 1987, Vol 42, Num 1, pp 69-82, issn 0020-0255Article

Space and Time Efficient Algorithms for Planted Motif SearchDAVILA, Jaime; BALLA, Sudha; RAJASEKARAN, Sanguthevar et al.Lecture notes in computer science. 2006, pp 822-829, issn 0302-9743, isbn 3-540-34379-2, 8 p.Conference Paper

Optimizing search with positive information feedbackSTEWART, T. J.Naval research logistics quarterly. 1985, Vol 32, Num 2, pp 263-274, issn 0028-1441Article

Effective and efficient solution of some lot- sizing problems by Tabu searchHINDI, K. S.INRIA / IEEE symposium on emerging technologies and factories automation. 1995, pp 291-298, isbn 0-7803-2535-4, 3VolConference Paper

A conjecture of Ross for a search problemWHITE, D. J.Journal of mathematical analysis and applications. 1992, Vol 166, Num 1, pp 263-271, issn 0022-247XArticle

Algorithms for three-dimensional dominance searching in linear spaceMAKRIS, C; TSAKALIDIS, A.Information processing letters. 1998, Vol 66, Num 6, pp 277-283, issn 0020-0190Article

New results on intersection query problemsBOZANIS, P; KITSIOS, N; MAKRIS, C et al.Computer journal (Print). 1997, Vol 40, Num 1, pp 22-29, issn 0010-4620Article

Rendezvous search on the line with distinguishable playersALPERN, S; GAL, S.SIAM journal on control and optimization. 1995, Vol 33, Num 4, pp 1270-1276, issn 0363-0129Article

Five counterfeit coinsTOSIC, R.Journal of statistical planning and inference. 1989, Vol 22, Num 2, pp 197-202, issn 0378-3758, 6 p.Article

Optimal search for one of many objects hidden in two boxesSHARLIN, A.European journal of operational research. 1987, Vol 32, Num 2, pp 251-259, issn 0377-2217Article

Fast dynamic intersection searching in a set of iso-isothetic line segmentsGÜTING, R. H.Information processing letters. 1985, Vol 21, Num 4, pp 165-171, issn 0020-0190Article

Efficient splitting and merging algorithms for order decomposable problemsGROSSI, R; ITALIANO, G. F.Lecture notes in computer science. 1997, pp 605-615, issn 0302-9743, isbn 3-540-63165-8Conference Paper

Searching for primitive roots in finite fieldsSHOUP, V.Mathematics of computation. 1992, Vol 58, Num 197, pp 369-380, issn 0025-5718Article

Searching adered structuresLINIAL, N; SAKS, M.Journal of algorithms (Print). 1985, Vol 6, Num 1, pp 86-103, issn 0196-6774Article

The optimal search for a moving target when the search path is constrainedEAGLE, J. N.Operations research. 1984, Vol 32, Num 5, pp 1107-1115, issn 0030-364XArticle

Analogical reasoning based on task ontologies for on-line supportHAMAGUCHI, Takashi; YAMAZAKI, Taku; MENG HU et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28894-5, vol1, 155-161Conference Paper

Exploiting the constrainedness in constraint satisfaction problemsSALIDO, Miguel A; BARBER, Federico.Lecture notes in computer science. 2004, pp 126-136, issn 0302-9743, isbn 3-540-22959-0, 11 p.Conference Paper

To block or not to block?ROMERO, Alejandro Gonzalez; ALQU, Rend; ZAR et al.Lecture notes in computer science. 2004, pp 134-143, issn 0302-9743, isbn 3-540-23806-9, 10 p.Conference Paper